\select@language {british}
\contentsline {chapter}{\numberline {1}Introduction}{6}{chapter.1}
\contentsline {chapter}{\numberline {2}Background}{7}{chapter.2}
\contentsline {section}{\numberline {2.1}The Prisoner's Dilemma Game}{7}{section.2.1}
\contentsline {section}{\numberline {2.2}Payoffs and Equilibrium}{8}{section.2.2}
\contentsline {subsection}{\numberline {2.2.1}Outcomes}{8}{subsection.2.2.1}
\contentsline {subsection}{\numberline {2.2.2}Payoffs Table}{8}{subsection.2.2.2}
\contentsline {subsection}{\numberline {2.2.3}Nash Equilibrium}{8}{subsection.2.2.3}
\contentsline {subsection}{\numberline {2.2.4}Pareto Optimality}{9}{subsection.2.2.4}
\contentsline {section}{\numberline {2.3}Achieving Collusion}{9}{section.2.3}
\contentsline {section}{\numberline {2.4}Repeated Prisoner's Dilemma}{11}{section.2.4}
\contentsline {subsection}{\numberline {2.4.1}Repeated Prisoner's Dilemma and Number of Rounds}{12}{subsection.2.4.1}
\contentsline {subsection}{\numberline {2.4.2}Properties of Iterated Prisoner's Dilemma}{12}{subsection.2.4.2}
\contentsline {section}{\numberline {2.5}Existing Na\IeC {\"\i }ve Repeated Prisoner's Dilemma Strategies}{12}{section.2.5}
\contentsline {subsection}{\numberline {2.5.1}Axelrod's Tournaments}{13}{subsection.2.5.1}
\contentsline {subsection}{\numberline {2.5.2}Existing Strategies}{14}{subsection.2.5.2}
\contentsline {subsection}{\numberline {2.5.3}Strong Strategies Analysis}{16}{subsection.2.5.3}
\contentsline {section}{\numberline {2.6}Relevance to Genetic Algorithms}{16}{section.2.6}
\contentsline {subsection}{\numberline {2.6.1}Example 1: Worker Bees}{16}{subsection.2.6.1}
\contentsline {subsection}{\numberline {2.6.2}Example 2: Birds and Parasites}{17}{subsection.2.6.2}
\contentsline {section}{\numberline {2.7}Current State of the Art and Employing Genetic Algorithms}{17}{section.2.7}
\contentsline {subsection}{\numberline {2.7.1}Evolutionary Algorithm}{18}{subsection.2.7.1}
\contentsline {subsection}{\numberline {2.7.2}Genetic Algorithms to Combine Experts Advice}{19}{subsection.2.7.2}
\contentsline {subsubsection}{Expert Algorithms}{19}{subsubsection*.4}
\contentsline {subsubsection}{Minimum Regret (MR)}{19}{subsubsection*.5}
\contentsline {subsubsection}{Exploration-Exploitation Experts Method (EEE)}{21}{subsubsection*.6}
\contentsline {chapter}{\numberline {3}Project Plan}{23}{chapter.3}
\contentsline {section}{\numberline {3.1}Objectives}{23}{section.3.1}
\contentsline {subsection}{\numberline {3.1.1}Coding the Environment}{23}{subsection.3.1.1}
\contentsline {subsection}{\numberline {3.1.2}Coding Na\IeC {\"\i }ve and Existing Strategies}{23}{subsection.3.1.2}
\contentsline {subsection}{\numberline {3.1.3}Using Genetic Algorithms}{23}{subsection.3.1.3}
\contentsline {subsection}{\numberline {3.1.4}Conclusion}{23}{subsection.3.1.4}
\contentsline {section}{\numberline {3.2}Timetable}{24}{section.3.2}
\contentsline {section}{\numberline {3.3}Extensions and Fallback}{24}{section.3.3}
\contentsline {chapter}{\numberline {4}Evaluation Plan}{25}{chapter.4}
\contentsline {section}{\numberline {4.1}Environment}{25}{section.4.1}
\contentsline {section}{\numberline {4.2}Genetic Algorithms}{25}{section.4.2}
\contentsline {section}{\numberline {4.3}Benchmark}{25}{section.4.3}
\contentsline {chapter}{Bibliography}{26}{chapter*.7}
